General gradient projection method of interior points for linear coustrained optimization 一個求解線性不等式約束的非線性規劃的廣義梯度投影內點算法
Generalized three term - memory gradient projection method for nonlinear programming with nonlinear equality and inequality constraints 求解非線性等式和不等式約束優化問題的三項記憶梯度廣義投影算法
Then based on the gradient projection method , the gradient projection direction is deduced . the gradient direction is the base for sensitivity analysis 接著,根據投影梯度法,推導出了投影梯度方向,該梯度方向是靈敏度分析的基礎。
In chapter 2 . we give a class of new algorithms for nonlinear programming problems with linear constrained by combining the gradient projection method with non - quasi - newton method which was given in paper [ 2 ] . it ' s global convergence and the superlinear convergence are proved under suitable conditions 在第二章中我們將梯度投影與文[ 2 ]中的非擬牛頓法相結合,給出了求解線性約束非線性優化問題的一類梯度投影非擬牛頓算法。
Used perturbed method and making inexact generalized gradient projection with cone , perturbed generalized gradient projection method is proposed . the field of the algorithm is extended . numerical experiments show that the method is effective . secondly , using the trust region form and the pseudo - directional derivative of minimax problem , we propose the trust region form of minimax problem 對信賴域法作了進一步的研究,借助minimax問題的偽方向導數,構造出其信賴域二次模型,并結合非單調策略,給出求解minimax問題的簡單易行的信賴域算法。
In chapter 5 , the authors study the convergence properties of the gradient projection method for the constrained optimization problem . in this chapter , a new step - size rule , which avoids fulfiling the classical line search and includes choosing a constant as the step size as a special case , is presented and analyzed 第五章研究了求解約束最優化問題的梯度投影方法,在步長的選取時采用了一種新的策略,這種策略不需要進行傳統的線搜索且包含步長取常數這種特例,在較弱的條件下,證明了梯度投影方法的全局收斂性。